Efficiency and applications of SAT-based test pattern generation: complex fault models and optimisation problems
نویسنده
چکیده
Modern technologies have enabled the semiconductor industry to enter a new era of integrated-circuit manufacturing. Modern ICs are not only smaller and signi cantly more high-performing than they used to be only a few years ago; they are also considerably more energy-e cient thanks to the use of new materials with convenient electric properties. However, the use of new materials is also making the fabrication process more di cult to control, and the new chips are more prone to defects. In consequence, the role of fault models that allow to describe complex forms of faulty behaviour is becoming increasingly important in hardware test and diagnosis. Without doubt, automatic test pattern generation (ATPG) is the most important test task. ATPG algorithms need to be not only run-time-e cient and to produce compact test sets, given the large number of faults that need to be targeted in multibillion-transistor ICs; they also need to keep pace with the development of new mechanisms for the description of faulty behaviour. Traditionally, ATPG algorithms used in industrial applications are structural, i.e. their reasoning is based on the circuit’s structure. However, SAT-based algorithms, i.e. methods that map the ATPG problem to the problem of Boolean satis ability (SAT), have recently started to gain relevance because they perform better than structural methods on important classes of faults. is doctoral thesis covers the work on SAT-based test pattern generation performed by the thesis’s author between 2008 and 2012. It presents the SAT-based ATPG tool Tiguan and explains in detail all important aspects that were considered in order to make Tiguan a highly e cient test pattern generator capable of calculating provably optimal solutions for complex ATPG problems. e most important contributions of the work presented in this thesis can be summarised as follows: ▸ e general run-time e ciency of SAT-based ATPG was increased through intelligent mapping of the ATPG problem to SAT, through the optimal utilisa-
منابع مشابه
High Fault Coverage ATPG for Industrial Application using DYNAMIC SAT Technique
It is a novel technique for automatic test pattern generation which well detects both easy to detect faults and hard to detect faults. ATPG based on this SAT technique dynamic clause activation (DCA) generates a limited number of test patterns which can cover more faults. ATPG based on implication graph have problems to cope with hard-todetect faults. ATPG based on Boolean satisfiability does n...
متن کاملATPG Using Fast Justification and Propagation on the Implication Graph
Automatic Test Pattern Generation (ATPG) primarily has to solve three fundamental Boolean problems: justification, propagation, and implication. In the past, various data structures (e.g. netlists, CNFs, decision diagrams) have been used to tackle these problems with none of them being specifically optimized for all these tasks. That is why we propose fast and optimized algorithms for justifica...
متن کاملA Two-Stage SAT-based ATPG Approach with Reduced Switching Activity
Due to the rising performance and decreasing feature sizes of today’s designs, the likelihood of delay defects increases. Therefore, transition fault testing is widely used to ensure that the delivered chips are free of fabrication defects. Due to the use of scan testing, the switching activity in the Circuit Under Test (CUT) is typically several times higher than during normal functional opera...
متن کاملFault Detection Based on Type 2 Fuzzy system for Single-Rod Electrohydraulic Actuator
Electro-hydraulic systems with regards to the their specific features and applications among other industrial systems including mechanical, electrical and pneumatic systems, have been widely taken into consideration by the scientists and researchers. Due to the fact that the electro-hydraulic system is inherently a nonlinear system, has some problems such as signals saturation, nonlinear effici...
متن کاملSearch Algorithms for Satisfiability Problems in Combinational Switching Circuits
SEARCH ALGORITHMS FOR SATISFIABILITY PROBLEMS IN COMBINATIONAL SWITCHING CIRCUITS by João Paulo Marques da Silva Chair: Karem A. Sakallah A number of tasks in computer-aided analysis of combinational circuits, including test pattern generation, timing analysis, delay fault testing and logic verification, can be viewed as particular formulations of the satisfiability problem (SAT). The first pur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013